The Web in 2010: Challenges and Opportunities for Database Research
Identifieur interne : 000D10 ( Main/Exploration ); précédent : 000D09; suivant : 000D11The Web in 2010: Challenges and Opportunities for Database Research
Auteurs : Gerhard Weikum [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2001.
English descriptors
- Teeft :
- Active streams, Admission control, Application programs need, Application server, Authority assessment, Better search result quality, Building blocks, Cherno, Computer science, Concurrency control, Content provider, Content providers, Continuous availability, Coral reef, Data graph, Database, Database research, Database system, Database systems, Database technology, Deep search, Digital libraries, Discrete data, Document, Downtime, Element names, Element paths, Element variables, Elusive goal, Engineering rule, Gerhard, Gerhard weikum, Grand challenge, Grand challenges, Great synergy, Guarantee, Ieee data engineering bulletin, Ieee internet, Index lookups, Index structures, Information discovery, Information retrieval, Information retrieval technology, Information services, Information sources, Information systems, Information technology, Intelligent search, Internet, Intranet, Large deviation theory, Large extent, Large number, Load peaks, Main problem, Maximum number, Media server, Metrics, Morgan kaufmann, Multimedia, Next decade, Ontology, Other hand, Overall system, Percent availability, Performance evaluation, Performance guarantees, Poisson arrivals, Poor performance, Prentice hall, Provider, Quality guarantees, Query, Query language, Query languages, Query processing, Rapid growth, Real system, Relevance scores, Relevant documents, Research avenues, Response time, Response time distribution, Response time guarantees, Retrieval, Richer annotations, Round length, Sample documents, Search engine, Search engines, Search result, Search results, Server, Server resources, Service quality, Sigmod conference, Sigmod record, Similarity score, Similarity search, Special issue, Stochastic, Stochastic manner, Stochastic model, Such guarantees, Support vector machines, Term frequency, Total size, Useful results, User, Vacation destinations, Vector space model, Vldb journal, Weikum, Word occurrences, Workload.
Abstract
Abstract: The impressive advances in global networking and information technology provide great opportunities for all kinds of Web-based information services, ranging from digital libraries and information discovery to virtual-enterprise workflows and electronic commerce. However, many of these services still exhibit rather poor quality in terms of unacceptable performance during load peaks, frequent and long outages, and unsatisfactory search results.F or the next decade, the overriding goal of database research should be to provide means for building zero-administration, self-tuning information services with predictable response time, virtually continuous availability, and, ultimately, “moneyback” service-quality guarantees.A particularly challenging aspect of this theme is the quality of search results in digital libraries, scientific data repositories, and on the Web. To aim for more intelligent search that can truly find needles in haystacks, classical information retrieval methods should be integrated with querying capabilities for structurally richer Web data, most notably XML data, and automatic classi.cation methods based on standardized ontologies and statistical machine learning. This paper gives an overview of promising research directions along these lines.
Url:
DOI: 10.1007/3-540-44577-3_1
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000208
- to stream Istex, to step Curation: 000198
- to stream Istex, to step Checkpoint: 000B01
- to stream Main, to step Merge: 000D11
- to stream Main, to step Curation: 000D10
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">The Web in 2010: Challenges and Opportunities for Database Research</title><author><name sortKey="Weikum, Gerhard" sort="Weikum, Gerhard" uniqKey="Weikum G" first="Gerhard" last="Weikum">Gerhard Weikum</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:14BEF2208156A566BB17F2D31656067F67AAA95D</idno><date when="2001" year="2001">2001</date><idno type="doi">10.1007/3-540-44577-3_1</idno><idno type="url">https://api.istex.fr/document/14BEF2208156A566BB17F2D31656067F67AAA95D/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000208</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000208</idno><idno type="wicri:Area/Istex/Curation">000198</idno><idno type="wicri:Area/Istex/Checkpoint">000B01</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000B01</idno><idno type="wicri:doubleKey">0302-9743:2001:Weikum G:the:web:in</idno><idno type="wicri:Area/Main/Merge">000D11</idno><idno type="wicri:Area/Main/Curation">000D10</idno><idno type="wicri:Area/Main/Exploration">000D10</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">The Web in 2010: Challenges and Opportunities for Database Research</title><author><name sortKey="Weikum, Gerhard" sort="Weikum, Gerhard" uniqKey="Weikum G" first="Gerhard" last="Weikum">Gerhard Weikum</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>University of the Saarland, Saarbrücken</wicri:regionArea><placeName><region type="land" nuts="2">Sarre (Land)</region><settlement type="city">Sarrebruck</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2001</date></imprint><idno type="ISSN">0302-9743</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="Teeft" xml:lang="en"><term>Active streams</term><term>Admission control</term><term>Application programs need</term><term>Application server</term><term>Authority assessment</term><term>Better search result quality</term><term>Building blocks</term><term>Cherno</term><term>Computer science</term><term>Concurrency control</term><term>Content provider</term><term>Content providers</term><term>Continuous availability</term><term>Coral reef</term><term>Data graph</term><term>Database</term><term>Database research</term><term>Database system</term><term>Database systems</term><term>Database technology</term><term>Deep search</term><term>Digital libraries</term><term>Discrete data</term><term>Document</term><term>Downtime</term><term>Element names</term><term>Element paths</term><term>Element variables</term><term>Elusive goal</term><term>Engineering rule</term><term>Gerhard</term><term>Gerhard weikum</term><term>Grand challenge</term><term>Grand challenges</term><term>Great synergy</term><term>Guarantee</term><term>Ieee data engineering bulletin</term><term>Ieee internet</term><term>Index lookups</term><term>Index structures</term><term>Information discovery</term><term>Information retrieval</term><term>Information retrieval technology</term><term>Information services</term><term>Information sources</term><term>Information systems</term><term>Information technology</term><term>Intelligent search</term><term>Internet</term><term>Intranet</term><term>Large deviation theory</term><term>Large extent</term><term>Large number</term><term>Load peaks</term><term>Main problem</term><term>Maximum number</term><term>Media server</term><term>Metrics</term><term>Morgan kaufmann</term><term>Multimedia</term><term>Next decade</term><term>Ontology</term><term>Other hand</term><term>Overall system</term><term>Percent availability</term><term>Performance evaluation</term><term>Performance guarantees</term><term>Poisson arrivals</term><term>Poor performance</term><term>Prentice hall</term><term>Provider</term><term>Quality guarantees</term><term>Query</term><term>Query language</term><term>Query languages</term><term>Query processing</term><term>Rapid growth</term><term>Real system</term><term>Relevance scores</term><term>Relevant documents</term><term>Research avenues</term><term>Response time</term><term>Response time distribution</term><term>Response time guarantees</term><term>Retrieval</term><term>Richer annotations</term><term>Round length</term><term>Sample documents</term><term>Search engine</term><term>Search engines</term><term>Search result</term><term>Search results</term><term>Server</term><term>Server resources</term><term>Service quality</term><term>Sigmod conference</term><term>Sigmod record</term><term>Similarity score</term><term>Similarity search</term><term>Special issue</term><term>Stochastic</term><term>Stochastic manner</term><term>Stochastic model</term><term>Such guarantees</term><term>Support vector machines</term><term>Term frequency</term><term>Total size</term><term>Useful results</term><term>User</term><term>Vacation destinations</term><term>Vector space model</term><term>Vldb journal</term><term>Weikum</term><term>Word occurrences</term><term>Workload</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: The impressive advances in global networking and information technology provide great opportunities for all kinds of Web-based information services, ranging from digital libraries and information discovery to virtual-enterprise workflows and electronic commerce. However, many of these services still exhibit rather poor quality in terms of unacceptable performance during load peaks, frequent and long outages, and unsatisfactory search results.F or the next decade, the overriding goal of database research should be to provide means for building zero-administration, self-tuning information services with predictable response time, virtually continuous availability, and, ultimately, “moneyback” service-quality guarantees.A particularly challenging aspect of this theme is the quality of search results in digital libraries, scientific data repositories, and on the Web. To aim for more intelligent search that can truly find needles in haystacks, classical information retrieval methods should be integrated with querying capabilities for structurally richer Web data, most notably XML data, and automatic classi.cation methods based on standardized ontologies and statistical machine learning. This paper gives an overview of promising research directions along these lines.</div></front></TEI><affiliations><list><country><li>Allemagne</li></country><region><li>Sarre (Land)</li></region><settlement><li>Sarrebruck</li></settlement></list><tree><country name="Allemagne"><region name="Sarre (Land)"><name sortKey="Weikum, Gerhard" sort="Weikum, Gerhard" uniqKey="Weikum G" first="Gerhard" last="Weikum">Gerhard Weikum</name></region><name sortKey="Weikum, Gerhard" sort="Weikum, Gerhard" uniqKey="Weikum G" first="Gerhard" last="Weikum">Gerhard Weikum</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Sarre/explor/MusicSarreV3/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000D10 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000D10 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Sarre
|area= MusicSarreV3
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:14BEF2208156A566BB17F2D31656067F67AAA95D
|texte= The Web in 2010: Challenges and Opportunities for Database Research
}}
| This area was generated with Dilib version V0.6.33. |  |